Single Pulse Plots We use a software package called PRESTO to search through the data looking for pulsars. For each pointing, PRESTO computes a fast Fourier transform (FFT) and single-pulse search at various trial values

Source URL: pulsarsearchcollaboratory.com

Fast Exhaustive Search for Quadratic Systems in F2 on FPGAs Charles Bouillaguet, Chen-Mou Cheng, Tung Chou, Ruben Niederhagen, Bo-Yin Yang August 15, 2013

Source URL: polycephaly.org

Very Fast Similarity Queries on Semi-Structured Data from the Web Bhavana Dalvi School of Computer Science Carnegie Mellon University

Source URL: www.cs.cmu.edu

• Statistical classification
• Statistics
• Search algorithms
• Support vector machine
• K-nearest neighbors algorithm
• K-means clustering
• Data
• Topological graph theory
• Learning
• Machine learning

X1 Changes the Search Game by Enabling Fast and Secure Desktop Search from Mobile Devices X1’s Mobile Search App Brings Mobility to Enterprise Search PASADENA, Calif. –(August 26, 2015)—X1, a leading enterprise sea

Source URL: www.x1.com

Genome Informatics 15(1): 93–Clustering of Database Sequences for Fast Homology Search Using Upper Bounds on Alignment Score

Source URL: www.jsbi.org

• Computational phylogenetics
• Bioinformatics
• Biology
• BLAST
• FASTA
• Cluster analysis
• Sequence
• SmithWaterman algorithm
• BLOSUM
• Sequence clustering
• Sequence alignment

bibme A Web 2.0 Bibliography Tool BibMe (bibme.org) is a Web-based bibliography tool. It is fast and easy to build a citation page because of its automated interface. Simply type in a search term under the appropriate

Source URL: technologyinfusion.weebly.com

Fast Shape-Based Nearest-Neighbor Search for Brain MRIs using Hierarchical Feature Matching Peihong Zhu, Suyash P. Awate, Samuel Gerber, and Ross Whitaker Scientific Computing and Imaging Institute, University of Utah C

Source URL: www.sci.utah.edu

What your Recruiter Wants from you With a little research and knowledge on how the recruitment process works you’ll be on the fast track to landing your dream job. A job search can feel overwhelming and it can be hard

Source URL: www.mycareerfox.com

Predictive Indexing for Fast Search Sharad Goel Yahoo! Research New York, NY 10018

Source URL: hunch.net

• Information science
• Search algorithms
• Information retrieval
• Nearest neighbor search
• Locality-sensitive hashing
• Similarity search
• PageRank
• Search engine indexing
• Computational geometry
• Hash function
• IDistance
• Search engine technology

Fast And Space Efficient Trie Searches Phil Bagwell Searching and traversing m-way trees using tries is a well known and broadly used technique. Three algorithms are presented, two have constant insert, search or delete

Source URL: idea.popcount.org